On series-parallel extensions of uniform matroids

نویسندگان

  • Brahim Chaourar
  • James G. Oxley
چکیده

This paper gives an excluded-minor characterization of the class of matroids that are series-parallel extensions of uniform matroids.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generation of Oriented Matroids - A Graph Theoretical Approach

We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretical representations of oriented matroids, and all these methods work in general rank and for nonuniform and uniform oriented matroids as well. We consider two types of graphs, cocircuit graphs and tope graphs, and discus...

متن کامل

Circular Flow and Circular Chromatic Number in the Matroid Context

This thesis considers circular flow-type and circular chromatic-type parameters (φ and χ, respectively) for matroids. In particular we focus on orientable matroids and 6 √ 1-matroids. These parameters are obtained via two approaches: algebraic and orientation-based. The general questions we discuss are: bounds for flow number; characterizations of Eulerian and bipartite matroids; and possible c...

متن کامل

Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets

In this paper, we introduce a uniform random sampler for linear extensions of Series-Parallel posets. The algorithms we present ensure an essential property of random generation algorithms: entropy. They are in a sense optimal in their consumption of random bits.

متن کامل

Join Congruence Relations on Geometric Lattices

In this paper, we show that the parallel connection of two matroids and the elementary quotient of a matroid can be obtained directly from the lattice of flats of the original matroids using join congruence relations.

متن کامل

The Binary Matroids with No 4-wheel Minor

The cycle matroids of wheels are the fundamental building blocks for the class of binary matroids. Brylawski has shown that a binary matroid has no minor isomorphic to the rank-3 wheel M(1f3) if and only if it is a series-parallel network. In this paper we characterize the binary matroids with no minor isomorphic to M (if;.). This characterization is used to solve the critical problem for this ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2003